A Lattice Spanning-tree Entropy Function
نویسنده
چکیده
The function W (a, b) = 2π 0 dx 2π 0 dy ln[1−a cos x−b cos y−(1−a−b) cos(x+y)] which expresses the spanning-tree entropy for various two dimensional lattices, for example, is evaluated directly in terms of standard functions. It is applied to derive several limiting values of the Triangular lattice Green function.
منابع مشابه
LOCAL CHARACTERISTICS, ENTROPY AND LIMIT THEOREMS FOR SPANNING TREES AND DOMINO TILINGS VIA TRANSFER-IMPEDANCES Running Head: LOCAL BEHAVIOR OF SPANNING TREES
Let G be a finite graph or an infinite graph on which ZZ acts with finite fundamental domain. If G is finite, let T be a random spanning tree chosen uniformly from all spanning trees of G; if G is infinite, methods from [Pem] show that this still makes sense, producing a random essential spanning forest of G. A method for calculating local characteristics (i.e. finite-dimensional marginals) of ...
متن کاملA Novel Image Encryption Model Based on Hybridization of Genetic Algorithm, Chaos Theory and Lattice Map
Encryption is an important issue in information security which is usually provided using a reversible mathematical model. Digital image as a most frequently used digital product needs special encryption algorithms. This paper presents a new encryption algorithm high security for digital gray images using genetic algorithm and Lattice Map function. At the first the initial value of Logistic Map ...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کامل